A Process Algebra for Timed Systems

A Process Algebra for Timed Systems

Termination in timed process algebra

We investigate different forms of termination in timed process algebras. The integrated framework of discrete and dense time, relative and absolute time process algebras is extended with forms of successful and unsuccessful termination. The different algebras are interrelated by embed dings and conservative extensions.

CSP + Clocks: a Process Algebra for Timed Automata

We propose a real-time extension to the process algebra CSP. Inspired by timed automata, a very successful formalism for the specification and verification of real-time systems, we handle real time by means of clocks, i.e. real-valued variables that increase at the same rate as time. This differs from the conventional approach based on timed transitions. We give a discrete trace and failures se...

Testing Semantics for a Probabilistic-Timed Process Algebra

In this paper we present a probabilistic-timed process algebra, which try to unify the best solutions of previous probabilistic and timed algebras. We provide an operational semantics for the new language (PTPA), and from this operational semantics we define a testing semantics based on the probability with which processes pass tests. Afterwards the induced testing equivalence is operationally ...

Process Algebra with Timed-Priority Executing Policy

Equipped with powerful machines and complex softwares, web servers providing services are widely used all over the Internet. But, how to specify their behaviors are interesting and meaningful. However, process algebras nowadays cannot specify the behaviors of web servers with time limitations and different groups of clients who are belong to different groups/priorities. The behaviors of web ser...